Influence of developer factors on code quality: a data study

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Automatic source-code inspection tools help to assess, monitor and improve code quality. Since these tools only examine the software project’s codebase, they overlook other possible factors that may impact code quality and the assessment of the technical debt (TD). Our initial hypothesis is that human factors associated with the software developers, like coding expertise, communication skills, and experience in the project have some measurable impact on the code quality. In this exploratory study, we test this hypothesis on two large open source repositories, using TD as a code quality metric and the data that may be inferred from the version control systems. The preliminary results of our statistical analysis suggest that the level of participation of the developers and their experience in the project have a positive correlation with the amount of TD that they introduce. On the contrary, communication skills have barely any impact on TD.Peer ReviewedPostprint (author's final draft

Desenvolupament d’aplicacions web

Aquest article pretén aportar una visió panoràmica del desenvolupament de les aplicacions web i, en particular, donar a conèixer algunes de les tècniques, eines i metodologies que usen els professionals que s’hi dediquen. Per aquesta raó caldrà analitzar amb una mica de detall l’origen, les categories, les característiques i l’arquitectura interna de les aplicacions webPostprint (published version

The Constructive method for query containment checking (extended version)

We present a new method that checks Query Containment for queries with negated derived atoms and/or integrity constraints. Existing methods for Query Containment checking that deal with these cases do not check actually containment but another related property called uniform containment, which is a sufficient but not necessary condition for containment. Our method can be seen as an extension of the canonical databases approach beyond the class of conjunctive queries.Postprint (published version

How tertiary studies perform quality assessment of secondary studies in software engineering

Best Paper Award a l’Experimental Software Engineering Track (ESELAW) de la XXIV Ibero-American Conference on Software Engineering, CIbSE 2021Context: Tertiary studies are becoming increasingly popular in software engineering as an instrument to synthesise evidence on a research topic in a systematic way. In order to understand and contextualize their findings, it is important to assess the quality of the selected secondary studies. Objective: This paper aims to provide a state of the art on the assessment of secondary studies’ quality as conducted in tertiary studies in the area of software engineering, reporting the frameworks used as instruments, the facets examined in these frameworks, and the purposes of the quality assessment. Method: We designed this study as a systematic mapping responding to four research questions derived from the objective above. We applied a rigorous search protocol over the Scopus digital library, resulting in 47 papers after application of inclusion and exclusion criteria. The extracted data was synthesised using content analysis. Results: A majority of tertiary studies perform quality assessment. It is not often used for excluding studies, but to support some kind of investigation. The DARE quality assessment framework is the most frequently used, with customizations in some cases to cover missing facets. We outline the first steps towards building a new framework to address the shortcomings identified. Conclusion: This paper is a step forward establishing a foundation for researchers in two different ways. As authors of tertiary studies, understanding the different possibilities in which they can perform quality assessment of secondary studies. As readers, having an instrument to understand the methodological rigor upon which tertiary studies may claim their findings.Peer ReviewedAward-winningPostprint (author's final draft

Towards continuous software release planning

@2017 Personal use of these materials is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating news collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksContinuous software engineering is a new trend that is gaining increasing attention of the research community in the last years. The main idea behind this trend is to tighten the connection between the software engineering lifecycle activities (e.g., development, planning, integration, testing, etc.). While the connection between development and integration (i.e., continuous integration) has been subject of research and is applied in industrial settings, the connection between other activities is still in a very early stage. We are contributing to this research topic by proposing our ideas towards connecting the software development and software release planning activities (i.e., continuous software release planning). In this paper we present our initial findings on this topic, how we envision to address the continuous software release planning, and a research agenda to fulfil our objectives.Peer ReviewedPostprint (author's final draft

Validation of schema mappings with nested queries

With the emergence of the Web and the wide use of XML for representing data, the ability to map not only flat relational but also nested data has become crucial. The design of schema mappings is a semi-automatic process. A human designer is needed to guide the process, choose among mapping candidates, and successively refine the mapping. The designer needs a way to figure out whether the mapping is what was intended. Our approach to mapping validation allows the designer to check whether the mapping satisfies certain desirable properties. In this paper, we focus on the validation of mappings between nested relational schemas, in which the mapping assertions are either inclusions or equalities of nested queries. We focus on the nested relational setting since most XML’s Document Type Definitions (DTDs) can be represented in this model. We perform the validation by reasoning on the schemas and mapping definition. We take into account the integrity constraints defined on both the source and target schema.Preprin

State of the practice on software release planning

In the recent years, the academic literature has reported many different proposals addressing the problem of Software Release Planning (SRP). However, nearly none of these results has been transferred to commercial tools for project management, although many of these tools claim to support some SRP tasks. In this paper, we present a study on 119 project management tools to know to which extent they use advanced AI-assisted algorithms/techniques to support SRP tasks.Peer ReviewedPostprint (published version

Testing Termination of Query Satisfiability Checking on Expressive Database Schemas

A query is satisfiable if there is at least one consistent instance of the database in which it has a non-empty answer. Defining queries on a database schema and checking their satisfiability can help the database designer to be sure whether the produced database schema is what was intended. The formulation of such queries may easily require the use of some arithmetic comparisons or negated expressions. Unfortunately, checking the satisfiability of this class of queries on a database schema that most likely have some integrity constraints (e.g., keys, foreign keys, Boolean checks) is, in general, undecidable. However, although the problem is undecidable for such a class of schemas and queries, it may not be so for a particular query satisfiability check. In this paper, we propose to perform a termination test as a previous step to query satisfiability checking. If positive, the termination test guarantees that the corresponding query satisfiability check will terminate. We assume the CQC method is the underlying query satisfiability checking method; to the best of our knowledge, it is the only method of this kind able to deal with schemas and queries as expressive as the ones we consider.Preprin

A schema-only approach to validate XML schema mappings

Since the emergence of the Web, the ability to map XML data between different data sources has become crucial. Defining a mapping is however not a fully automatic process. The designer needs to figure out whether the mapping is what was intended. Our approach to this validation consists of defining and checking certain desirable properties of mappings. We translate the XML schemas and the mapping into first-order logic formalism and apply a reasoning mechanism to check the desirable properties automatically, without assuming any particular instantiation of the schemas.Preprin

Query containment checking as a view updating problem

In this paper we present a new approach that handles query containment problems by expressing them as a view updating problem. Since this approach is independent of any particular view updating method, it provides a general framework that joins research efforts in both the query containment checking and view updating fields. In particular, the larger development of current view updating technology allows us to check properly query containment when considering negative-derived literals or integrity constraints. Existing methods for query containment checking that deal with these cases do not check actually containment but another related property called uniform containment, which is a sufficient but not necessary condition for containment. Therefore, an important outcome of our proposal is that, to the best of our knowledge, it is the first approach that checks true query containment instead of uniform query containment in the presence of negation and integrity constraints.Postprint (published version